\hypertarget{goodselect_8h}{}\section{src/select\+\_\+algorithms/good\+\_\+select/goodselect.h File Reference}
\label{goodselect_8h}\index{src/select\+\_\+algorithms/good\+\_\+select/goodselect.\+h@{src/select\+\_\+algorithms/good\+\_\+select/goodselect.\+h}}
{\ttfamily \#include $<$vector$>$}\\*
{\ttfamily \#include \char`\"{}src/sort\+\_\+algorithms/quick\+\_\+sort/quicksort.\+h\char`\"{}}\\*
\subsection*{Namespaces}
\begin{DoxyCompactItemize}
\item 
 \hyperlink{namespace_introduction_to_algorithm}{Introduction\+To\+Algorithm}
\begin{DoxyCompactList}\small\item\em Namespace of Introdunction\+To\+Algorithm. \end{DoxyCompactList}\item 
 \hyperlink{namespace_introduction_to_algorithm_1_1_select_algorithm}{Introduction\+To\+Algorithm\+::\+Select\+Algorithm}
\begin{DoxyCompactList}\small\item\em Namespace of \hyperlink{namespace_introduction_to_algorithm_1_1_select_algorithm}{Select\+Algorithm}. \end{DoxyCompactList}\end{DoxyCompactItemize}
\subsection*{Functions}
\begin{DoxyCompactItemize}
\item 
{\footnotesize template$<$typename Iterator , typename Compare\+Type  = std\+::less$<$typename std\+::iterator\+\_\+traits$<$\+Iterator$>$\+::value\+\_\+type$>$$>$ }\\std\+::iterator\+\_\+traits$<$ Iterator $>$\+::value\+\_\+type \hyperlink{namespace_introduction_to_algorithm_1_1_select_algorithm_af7d1f100ddee11d1de6bde2cd86d8be3}{Introduction\+To\+Algorithm\+::\+Select\+Algorithm\+::good\+\_\+select} (const Iterator begin, const Iterator end, typename std\+::iterator\+\_\+traits$<$ Iterator $>$\+::difference\+\_\+type rank, Compare\+Type compare=Compare\+Type())
\begin{DoxyCompactList}\small\item\em good\+\_\+select： 算法导论第9章9.3 最坏时间为\+O(n)的顺序统计量选择算法 \end{DoxyCompactList}\end{DoxyCompactItemize}
